A formalization of multi-tape Turing machines
نویسندگان
چکیده
منابع مشابه
A formalization of multi-tape Turing machines
We discuss the formalization, in the Matita Theorem Prover, of basic results on multi-tapes Turing machines, up to the existence of a (certified) Universal Machine, and propose it as a natural benchmark for comparing different interactive provers and assessing the state of the art in the mechanization of formal reasoning. The work is meant to be a preliminary step towards the creation of a form...
متن کاملNondeterministic One-Tape Off-Line Turing Machines
Finite state control Semi-infinite tape which contains, at the beginning of the computation: the input string, on its part of the tape the blank symbol, in the remaining squares According to the transition function at each step the machine: changes its internal state writes a nonblank symbol on the scanned tape square moves the head either to the left, or to the right, or keeps it on the same s...
متن کاملParallel Turing Machines on a Two-Dimensional Tape
We introduce two models of parallel twodimensional Turing machine with different possibilities of communication among control units and we compare them.
متن کاملComputability of the entropy of one-tape Turing machines
We prove that the maximum speed and the entropy of a one-tape Turing machine are computable, in the sense that we can approximate them to any given precision . This is counterintuitive, as all dynamical properties are usually undecidable for Turing machines. The result is quite specific to one-tape Turing machines, as it is not true anymore for two-tape Turing machines by the results of Blondel...
متن کاملThe Transfinite Action of 1 Tape Turing Machines
• We produce a classification of the pointclasses of sets of reals produced by infinite time turing machines with 1-tape. The reason for choosing this formalism is that it apparently yields a smoother classification of classes defined by algorithms that halt at limit ordinals. • We consider some relations of such classes with other similar notions, such as arithmetical quasi-inductive definitio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.07.013